A relation between the approximated versions of minimum set covering, minimum vertex covering and maximum independent set
نویسندگان
چکیده
منابع مشابه
Minimum Membership Set Covering and the Consecutive Ones Property
The Minimum Membership Set Cover problem has recently been introduced and studied in the context of interference reduction in cellular networks. It has been proven to be notoriously hard in several aspects. Here, we investigate how natural generalizations and variations of this problem behave in terms of the consecutive ones property: While it is well-known that classical set covering problems ...
متن کامل9.2 Minimum Feedback Vertex Set
Roughly speaking, the local ratio method works iteratively, and in each iteration it breaks a suitable structure (the local structure) to solve from the residual structure in that iteration. Typically the local structure is an instance that is very easy to solve. The main claim that is required is that the solution to the local structure can be patched with the solution from the next iteration,...
متن کاملA RELATION BETWEEN THE CATEGORIES Set * , SetT, Set AND SetT
In this article, we have shown, for the add-point monad T, thepartial morphism category Set*is isomorphic to the Kleisli category SetT. Alsowe have proved that the category, SetT, of T-algebras is isomorphic to thecategory Set of pointed sets. Finally we have established commutative squaresinvolving these categories.
متن کاملA Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کاملApproximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs
A box graph is the intersection graph of a finite set of orthogonal rectangles in the plane. The problem of whether or not the maximum independent set problem (MIS for short) for box graphs can be approximated within a substantially sub-logarithmic factor in polynomial time has been open for several years. We show that for box graphs on n vertices which have an independent set of size Ω(n/ log ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 1994
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro/1994280404131